منابع مشابه
Lower bound theorem for normal pseudomanifolds
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup’s generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected tria...
متن کاملLower Bounds for Cubical Pseudomanifolds
It is verified that the number of vertices in a d-dimensional cubical pseudomanifold is at least 2d+1. Using Adin’s cubical h-vector, it is established that the cubical Generalized Lower Bound Conjecture (GLBC) holds for all 4-spheres, as well as some special cases of the cubical GLBC in higher dimensions.
متن کاملLower Bound Theorems and a Generalized Lower Bound Conjecture for balanced simplicial complexes
A (d − 1)-dimensional simplicial complex is called balanced if its underlying graph admits a proper d-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs). Specifically, we prove the balanced analog of the celebrated Lower Bound Theorem for normal pseudomanifolds and characterize the case of equality; we introduce and ch...
متن کاملA lower bound for ...
Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a + b: a ∈ A, b ∈ B, and P (a, b) 6= 0}| where P (x, y) ∈ F[x, y].
متن کاملA Lower Bound for
It is proved that there is a monotone function in AC(0) 4 which requires exponential size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1995
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574038